An algorithm for coloring some perfect graphs
نویسندگان
چکیده
منابع مشابه
Coloring precolored perfect graphs
We consider the question of the computational complexity of coloring perfect graphs with some precolored vertices. It is well known that a perfect graph can be colored optimally in polynomial time. Our results give a sharp border between the polynomial and NP-complete instances, when precolored vertices occur. The key result on the polynomially solvable cases includes a good characterization th...
متن کاملAn ant-based algorithm for coloring graphs
This paper presents an ant-based algorithm for the graph coloring problem. An important difference that distinguishes this algorithm from previous ant algorithms is the manner in which ants are used in the algorithm. Unlike previous ant algorithms where each ant colors the entire graph, each ant in this algorithm colors a small portion of the graph using only local information. These individual...
متن کاملAn Ant System Algorithm for Coloring Graphs
This paper presents an ant system algorithm for the graph coloring problem. This ant system algorithm has several new features compared to previous ant system algorithms for the coloring problem. The main idea of the algorithm is for a colony of ants to color the graph, in which ants use its knowledge about the local neighborhood, recently visited nodes, and information stored at each vertex. F...
متن کاملGraph coloring , perfect graphs 1 Introduction to graph coloring
Let us improve this bound. Assume that G is a connected graph and T is its spanning tree rooted at r. Let us consider an ordering of V (G) in which each vertex v appears after its children in T . Now, for v 6= r we have |N(vi) ∩ {v1, . . . , vi−1}| ≤ deg v − 1, so c(vi) ≤ deg vi for vi 6= r. Unfortunately, the greedy may still need to use ∆(G) + 1 colors if deg r = ∆(G) and each child of r happ...
متن کاملDefective Coloring on Classes of Perfect Graphs
In Defective Coloring we are given a graph G and two integers χd,∆ ∗ and are asked if we can χd-color G so that the maximum degree induced by any color class is at most ∆∗. We show that this natural generalization of Coloring is much harder on several basic graph classes. In particular, we show that it is NP-hard on split graphs, even when one of the two parameters χd,∆ ∗ is set to the smallest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00082-4